Tensor products of modal logics
نویسندگان
چکیده
Products were introduced in the 1970s as a natural type of combined modal logics. They arise in different areas of pure and applied logics — spatial reasoning, multi-agent systems, quantified modal and intuitionistic logics etc. The theory of products was systematized and essentially developed first in the paper [GS98] and then in the book [GKWZ03], but during the past 10 years new important results were proved and the research is going on, cf. [Kur07]. Recall that the product of modal logics is defined as the logic of the class of products of their Kripke frames. On the one hand, this definition is quite natural, and in some cases products can be simply axiomatized and have nice properties. On the other hand, products are always Kripke complete. However, Kripke semantics sometimes may be inadequate. So different logics L1,L ′ 1 can have the same frames; then L1 × L2 = L1 × L2 for any L2 — which looks strange. Another peculiarity is logical non-invariance: it may happen that for some frames Log(F) = Log(F′), while Log(F× G) 6= Log(F′ × G). Also, if logics L1 and L2 are consistent, but L1 has an empty class of frames, then L1 × L2 is inconsistent. To amend the situation, we can try to define products of Kripke of models (or, equivalently, general Kripke frames or modal algebras). The following problem was mentioned in [Kur07, p. 877]: There are several attempts for extending the product construction from Kripke complete logics to arbitrary modal logics, mainly by considering product-like constructions on Kripke models. All the suggested methods so far result in sets of formulas that are not closed under the rule of Substitution.
منابع مشابه
Products of ‘transitive’ modal logics without the (abstract) finite model property
It is well known that many two-dimensional products of modal logics with at least one ‘transitive’ (but not ‘symmetric’) component lack the product finite model property. Here we show that products of two ‘transitive’ logics (such as, e.g., K4 ×K4, S4 × S4, Grz×Grz and GL×GL) do not have the (abstract) finite model property either. These are the first known examples of 2D modal product logics w...
متن کاملAxiomatizing the lexicographic products of modal logics with linear temporal logic
Given modal logics 1, 2, their lexicographic product 1 ⇤ 2 is a new logic whose frames are the Cartesian products of a 1-frame and a 2-frame, but with the new accessibility relations reminiscent of a lexicographic ordering. This article considers the lexicographic products of several modal logics with linear temporal logic (LTL) based on “next” and “always in the future”. We provide axiomatizat...
متن کاملModal Logic of Some Products of Neighborhood Frames
We consider modal logics of products of neighborhood frames and prove that for any pair L and L′ of logics from set {S4,D4,D,T} modal logic of products of Lneighborhood frames and L′-neighborhood frames is the fusion of L and L′.
متن کاملThe product of converse PDL and polymodal K
The product of two modal logics L1 and L2 is the modal logic determined by the class of frames of the form F G such that F and G validate L1 and L2, respectively. This paper proves the decidability of the product of converse PDL and polymodal K. Decidability results for products of modal logics of knowledge as well as temporal logics and polymodal K are discussed. All those products form rather...
متن کاملProducts of Modal Logics, Part 1
The paper studies many-dimensional modal logics corresponding to products of Kripke frames. It proves results on axiomatisability, the finite model property and decidability for product logics, by applying a rather elaborated modal logic technique: p-morphisms, the finite depth method, normal forms, filtrations. Applications to first order predicate logics are considered too. The introduction a...
متن کامل